Jul 28, 1999 · The purpose of this paper is to investigate the circular chromatic numbers of Mycielski's graphs. The circular chromatic number χc(G) of a graph ...

For a graph G, let M(G) denote the Mycielski graph of G. The t-th iterated. Mycielski graph of G, Mt(G), is defined recursively by M0(G) = G, and Mt(G)=.

For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular chromatic ...

Abstract For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular ...

As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by χ *(G).

(G). Later, Zhu called it circular chromatic number and denoted it by χc(G). Let χ(G) be the chromatic number of G. In this paper, it is shown.

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski devel- oped a graph transformation that transforms a graph G into a ...

Jan 15, 2009 · As a natural generalization of chromatic number of a graph, the circular chromatic number of graphs (or the star chromatic number) was ...

The circular chromatic number (also known as the star chromatic number) is a natural generalization of the chromatic number (note that a (k,1)-colouring is ...

The circular chromatic number of series-parallel graphs. In this article, we consider the circular chromatic number χc(G) of series-parallel graphs G. · High- ...